The Bramble-Pasciak preconditioner for saddle point problems
نویسندگان
چکیده
The Bramble-Pasciak Conjugate Gradient method is a well known tool to solve linear systems in saddle point form. A drawback of this method in order to ensure applicability of Conjugate Gradients is the need for scaling the preconditioner which typically involves the solution of an eigenvalue problem. Here, we introduce a modified preconditioner and inner product which without scaling enable the use of a minres variant and can be used for the simplified Lanczos process. Furthermore, the modified preconditioner and inner product can be combined with the original Bramble-Pasciak setup to give new preconditioners and inner products. We emphasize the new methods by showing numerical experiments for Stokes problems.
منابع مشابه
Domain Decomposition Algorithms for Saddle Point Problems
In this paper, we introduce some domain decomposition methods for saddle point problems with or without a penalty term, such as the Stokes system and the mixed formulation of linear elasticity. We also consider more general nonsymmetric problems, such as the Oseen system, which are no longer saddle point problems but can be studied in the same abstract framework which we adopt. Several approach...
متن کاملOn preconditioned Uzawa methods and SOR methods for saddle-point problems
This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondi erentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble– Pasciak–Vassilev condition on preconditioners for convergence of the inexact Uzawa method for linear saddle-point problems. The relaxed condition is used to determine the...
متن کاملA Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations
This paper provides a preconditioned iterative technique for the solution of saddle point problems. These problems typically arise in the numerical approximation of partial differential equations by Lagrange multiplier techniques and/or mixed methods. The saddle point problem is reformulated as a symmetric positive definite system, which is then solved by conjugate gradient iteration. Applicati...
متن کاملA Bramble-Pasciak-like method with applications in optimization
Saddle-point systems arise in many applications areas, in fact in any situation where an extremum principle arises with constraints. The Stokes problem describing slow viscous flow of an incompressible fluid is a classic example coming from partial differential equations and in the area of Optimization such problems are ubiquitous. In this manuscript we show how new approaches for the solution ...
متن کاملUzawa type algorithms for nonsymmetric saddle point problems
In this paper, we consider iterative algorithms of Uzawa type for solving linear nonsymmetric saddle point problems. Specifically, we consider systems, written as usual in block form, where the upper left block is an invertible linear operator with positive definite symmetric part. Such saddle point problems arise, for example, in certain finite element and finite difference discretizations of ...
متن کامل